Zaparoan negation revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QUICKSELECT Revisited

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

متن کامل

Negation Without Negation in Probabilistic Logic Programming

Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...

متن کامل

Negation and Double-Negation of Chinese Oppositeness

Oppositeness refers to the paradigmatic relationship of two words holding the contrast meanings. The fact that linguistic opposite differs from logical contrast has been discussed in theories, but has not been tested in practice. In this paper, we investigate three main subtypes of Chinese oppositeness, via using logical tests of negation and double-negation. Result shows that purely logical te...

متن کامل

PENDRED\'S SYNDROME REVISITED

Pendred's syndrome is defined as a triad of congenital perceptive hearing loss, goiter, and abnormal perchlorate test. Three brothers with Pendred's syndrome [P.S.] are reported. The oldest brother has hearing loss (he has been deaf and mute since childhood) and has a large goiter. A thyroid scan revealed euthyroid multinodular goiter and a perchlorate test was performed, and reported abno...

متن کامل

Combining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic

This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revista Brasileira de Linguística Antropológica

سال: 2019

ISSN: 2317-1375,2176-834X

DOI: 10.26512/rbla.v11i02.27300